Time-walk characteristics of an improved constant fraction discriminator
نویسندگان
چکیده
منابع مشابه
Off-line correction for excessive constant-fraction-discriminator walk in neutron time-of-flight experiments
A method for reducing excessive constant-fraction-discriminator walk that utilizes experimental data in the off-line analysis stage is introduced. Excessive walk is defined here as any walk that leads to an overall timing resolution that is much greater than the intrinsic timing resolution of the detection system. The method is able to reduce the contribution to the overall timing resolution fr...
متن کاملVector Regression degradation modeling for Constant Fraction Discriminator
In the nuclear industries, the electronic signal processing unit plays a key role in the data processing, data analysis, control mechanism and more importantly safety of the nuclear reactor. The processing unit comprises of different modules that process pulse and current signals from detector and constant fraction discriminator which has higher criticality is one of them. Earlier the reliabili...
متن کاملSimulating a Random Walk with Constant Error
We analyze Jim Propp’s P -machine, a simple deterministic process that simulates a random walk on Zd to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful summing. We mention three intriguing conjectures concerning signchanges and unimodality of functions in the linear span of {p(·,x) : x ∈ Zd}, where p(n,x) is the p...
متن کاملAn Improved Claw Finding Algorithm Using Quantum Walk
The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle which have domains of size N and M (N ≤ M), respectively, and the same range, the goal of the problem is to find x and y such that f (x) = g(y). This problem has been considered in both quantum and classical settings in t...
متن کاملAn Improved Random Walk Based Community Detection Algorithm
Community detection is an important issue in social network analysis, which aims at finding potential community structures such that the internal nodes of a community have higher closeness than external nodes. Taking into account node attribute information, this paper presents an improved community detection algorithm based on random walk. Based on the basic understanding that people getting to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Instruments and Methods
سال: 1981
ISSN: 0029-554X
DOI: 10.1016/0029-554x(81)90092-6